time and space complexity reduction of a cryptanalysis algorithm

binary decision diagram (in short bdd) is an efficient data structure which has been used widely in computer science and engineering. bdd-based attack in key stream cryptanalysis is one of the best forms of attack in its category. in this paper, we propose a new key stream attack which is based on zdd(zero-suppressed bdd). we show how a zdd-based key stream attack is more efficient in time and space complexity over its bdd-based variant against the e0 type of the bluetooth security mechanism. we implemented it by using the cudd - colorado university decision diagram package. experimental results show great improvements. we have also derived a mathematical proof, which shows that it is better than the bddbased attack method even for the worst case analysis.